Proving the Shalls1
نویسندگان
چکیده
This paper describes an experiment conducted to determine how effectively formal methods could be used to capture and validate the requirements of a typical embedded system. A model of the mode logic of a Flight Guidance System was specified in the RSML notation and translated into the NuSMV model checker and the PVS theorem prover. These tools were then used to verify several hundred properties of the RSML model. In the process, several errors were discovered and corrected in the original model. This demonstrates that formal requirements models can be written for real problems and that formal analysis tools have matured to the point where they can be used to find errors before implementation. It also points out a clear relationship between requirements stated informally as “shalls”, formal properties, and requirements models.
منابع مشابه
A Comparative Study on Presumption of Marriage Rule and Genetic Testing for Proving Parentage Under Iranian Law
Family is the most important social group, and the survival of society depends on the survival of the family and its survival depends on legitimate parentage and legal ties. Therefore, the issue of proving the parentage is one of the most sensitive issues in the Islamic law and the legislator has tried to preserve it by enacting laws. From the beginning of Islam until now, in Imami jurisprudenc...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملThe Logical Part of Essentiality and Unity of Existence in Proving the Unity of Necessary Being
This article has no abstract.
متن کاملتوسعه روش SL با ترتیب KBO برای اثبات خودکار پایانپذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کاملProving the efficiency of pro-2-groups of fixed co-classes
Among the six classes of pro-2-groups of finite and fixed co-classes and trivial Schur Multiplicator which studied by Abdolzadeh and Eick in 2009, there are two classes $$S_5=langle a,bmid [b,a^2]=1, a^2=[b,a]^2, (b^2)^{[b,a]}b^2=1rangle$$ and $$S_6=langle a,t,bmid a^2=b^2,[b,a]^2=1, t^a=t^{-1}[b,a], b^t=abarangle$$that have been conjectured to have deficiency zero presentations. In this paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003